Error correcting codes
General information
Title: A brief intro to Error correcting codes
Instructor : Mrinal Kumar
Email : first name AT tifr DOT res DOT in
Prerequisites
Some mathematical maturity and familiarity with the contents of a typical Discrete Math and Algorithms Class and comfort with reading and writing proofs.
Description
The course is aimed as an introduction to the theory of error correcting codes as a part of a short summer school in July 2026 at TIFR.
There will be ten lectures in the course.
Lectures
- July 13(1): Intro to error correcting codes and Reed-Solomon codes.
- July 13(2): Intro to finite fields, recalling some linear algebra.
- July 14(1): Decoding Reed-Solomon codes up to half the minimum distance.
- July 14(2): Decoding RS codes contd.
- July 15(1): List decoding and Sudan's algorithm for list decoding RS codes.
- July 15(2): Sudan's algorithm contd. Univariate multiplicity codes.
- July 16(1): Locally decodable codes: Hadamard codes.
- July 16(2): Hadamard codes contd.
- July 17(1): Fingerprinting, secret sharing using polynomials. Reed-Muller codes.
- July 17(2): The things we did not cover, but should have.
References